Dependence between path-length and size in random digital trees
نویسندگان
چکیده
منابع مشابه
Dependence between External Path-Length and Size in Random Tries
We study the size and the external path length of random tries and show that they are asymptotically independent in the asymmetric case but strongly dependent with small periodic fluctuations in the symmetric case. Such an unexpected behavior is in sharp contrast to the previously known results that the internal path length is totally positively correlated to the size and that both tend to the ...
متن کاملTotal Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. Mahmoud (1991) showed that Wn := (Tn − E[Tn])/n converges almost surely and in L2 to a nondegenerate limiting random variable W . Here we give recurrence relations for the moments of Wn and of W and show that Wn converg...
متن کاملDigital Search Trees Again Revisited: The Internal Path Length Perspective
This paper studies the asymptotics of the variance fOf the internal path length in a. symmetric digital search tree. The problem was open up to now. We prove that COf the binary digital search tree the variance is asymptolically equal 10 0.26600 ... · N + N6(1og2 N) where N is the number of stored records and 6(:z:) is a. periodic function of mean zero and a very small amplitude. This result im...
متن کاملThe total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efficiency of the algorithm/data structure. Using renewa...
متن کاملThe Maximal Path Length of Binary Trees
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the difference between the length of a shortest root-to-leaf path and the height). We characterize the maximum path length binary trees of a given height, size, and fringe thickness. Using this characterization, we give an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2017
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2017.56